Ela Sharp Lower Bounds for the Dimension of Linearizations of Matrix Polynomials∗
نویسندگان
چکیده
A standard way of dealing with matrix polynomial eigenvalue problems is to use linearizations. Byers, Mehrmann and Xu have recently defined and studied linearizations of dimensions smaller than the classical ones. In this paper, lower bounds are provided for the dimensions of linearizations and strong linearizations of a given m×n matrix polynomial, and particular linearizations are constructed for which these bounds are attained. It is also proven that strong linearizations of an n× n regular matrix polynomial of degree must have dimension n × n .
منابع مشابه
Sharp lower bounds for the dimension of linearizations of matrix polynomials
A standard way of dealing with matrix polynomial eigenvalue problems is to use linearizations. Byers, Mehrmann and Xu have recently defined and studied linearizations of dimensions smaller than the classical ones. In this paper, lower bounds are provided for the dimensions of linearizations and strong linearizations of a given m×n matrix polynomial, and particular linearizations are constructed...
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملEla Palindromic Linearizations of a Matrix Polynomial of Odd Degree Obtained from Fiedler Pencils with Repetition
Many applications give rise to structured, in particular T-palindromic, matrix polynomials. In order to solve a polynomial eigenvalue problem P (λ)x = 0, where P (λ) is a T-palindromic matrix polynomial, it is convenient to use palindromic linearizations to ensure that the symmetries in the eigenvalues, elementary divisors, and minimal indices of P (λ) due to the palindromicity are preserved. I...
متن کاملEla Linearizations of Singular Matrix Polynomials and the Recovery of Minimal Indices∗
A standard way of dealing with a regular matrix polynomial P (λ) is to convert it into an equivalent matrix pencil – a process known as linearization. Two vector spaces of pencils L1(P ) and L2(P ) that generalize the first and second companion forms have recently been introduced by Mackey, Mackey, Mehl and Mehrmann. Almost all of these pencils are linearizations for P (λ) when P is regular. Th...
متن کاملLinearization of Lagrange and Hermite interpolating matrix polynomials
This paper considers interpolating matrix polynomials P (λ) in Lagrange and Hermite bases. A classical approach to investigate the polynomial eigenvalue problem P (λ)x = 0 is linearization, by which the polynomial is converted into a larger matrix pencil with the same eigenvalues. Since the current linearizations of degree n Lagrange polynomials consist of matrix pencils with n + 2 blocks, they...
متن کامل